Multipotential Games∗ This version contains all proofs
نویسنده
چکیده
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a game is a q-potential game if and only if it is (up to an isomorphism) a q-congestion game. As a corollary, we derive the result that every game in strategic form is a qcongestion game for some q. It is further shown that every q-congestion game is isomorphic to a qnetwork game, where the network environment is defined by a directed graph with one origin and one destination. Finally we discuss our main agenda: The issue of representing q-congestion games with non-negative cost functions by congestion models with non-negative and monotonic facility cost functions. We provide some initial results in this regard.
منابع مشابه
Games, puzzles, and computation
There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea of game as computation to a greater deg...
متن کاملParallel Dialogue Games and Hypersequents for Intermediate Logics
A parallel version of Lorenzen’s dialogue theoretic foundation for intuitionistic logic is shown to be adequate for a number of important intermediate logics. The soundness and completeness proofs proceed by relating hypersequent derivations to winning strategies for parallel dialogue games. This also provides a computational interpretation of hypersequents.
متن کاملBayesian Games and the Smoothness Framework
We consider a general class of Bayesian Games where each players utility depends on his type (possibly multidimensional) and on the strategy profile and where players’ types are distributed independently. We show that if their full information version for any fixed instance of the type profile is a smooth game then the Price of Anarchy bound implied by the smoothness property, carries over to t...
متن کاملAn Introduction to Proofs of Determinacy of Long Games
We present the basic methods used in proofs of determinacy of long games, and apply these methods to games of continuously coded length. From the dawn of time women and men have aspired upward. The development of determinacy proofs is no exception to this general rule. There has been a steady search for higher forms of determinacy, beginning with the results of Gale–Stewart [2] on closed length...
متن کاملNon-signalling parallel repetition using de Finetti reductions
In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game G with optimal winning probability 1 − α and its repeated version G (in which n games are played together, in parallel), can the players use strategies that are substantially better than ones in which each game is played independently? This question is relevant in physics for the study o...
متن کامل